Application of Graph Theory in Computer Science

The field of mathematics have important roll in various fields. One of the important area in mathematics is Graph Theory. Which used in structural modeling in many area’s. The structural arrangements of various objects or technologies lead to new inventions and modification in the existing environment for enhancement in those field. The field of graph theory started from problem of Konigsberg bridge in 1735. This paper given an overview of the application of graph theory in heterogeneous field to some extent but mainly focuses on computer science application but uses graph theoretical concepts

Comprative Study Kirchoff’s and Tutte Matrix Theorem

In the mathematical field of graph theory, there are so many topic. In general the Cayley’s formula which provides the number of spanning tree in complete graph. There are two theorem Kirchoff’s Matrix theorem and Tutte Martrix theorem are also used to count spanning tree of a graph. In this paper we focus to count number of spanning in a graph with help of both theorem. At last we draw conclusion that Tutte Matrix theorem approach to compute the number of spanning arborescence of graph also